Probabilistic Neural Network-based Sensor Configuration Management in a Wireless Ad-hoc Network
نویسندگان
چکیده
This paper describes a novel application of a probabilistic neural network for overcoming the computational complexity involved in performing sensor configuration management in a collaborative sensor network. We consider the problem of reliably tracking a target moving through a field of stationary sensors by fusing the measurements returned from the distributed array of sensors while conserving power by minimizing the number of sensors participating in the decision-making at each step, which is a challenging problem of significant current interest. The twin, and often conflicting, requirements of high tracking accuracy (achievable by recruiting more sensors in order to develop fused decisions) and minimization of network latency (performing decisions using measurements from only a small subset of sensors) place a major emphasis on developing optimal strategies for sensor configuration management in such application scenarios. Recently suggested approaches to this problem typically employ Bayesian Networks and Influence Diagrams, which are computationally intensive and are often prohibitive for real time applications, particularly when the number of sensors involved is large. To overcome the computational complexity, we propose the use of a probabilistic neural network (PNN). The task for the PNN is to produce a distance measure (a radius, for instance) about a target location estimate within which to query sensors for observations by using the previous state estimate of the target as input. By integrating the PNN with a particle filter implementation of a tracking algorithm, we develop a collaborative distributed tracking scheme. Performance evaluation results are presented to demonstrate the benefits from sensor fusion (improvement of tracking accuracy) and reduction of latency (saving in the number of sensors deployed for accomplishing the task) in chosen tracking scenarios.
منابع مشابه
LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کاملThe Feedback Based Mechanism for Video Streaming Over Multipath Ad Hoc Networks
Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کامل